n,m=map(int,input().split())
l=list(map(int,input().split()))
c=l.count(1)
for pratyush in range(m):
a,b=map(int,input().split())
if a==1:
l[b-1]=1-l[b-1]
c+=(1 if l[b-1] else -1)
else:
print(1 if b<=c else 0)
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,q;
cin >> n >> q;
int flag[2] = {0};
int a[n];
for(int i = 0; i < n; i++)
{
cin >> a[i];
flag[a[i]]++;
}
while(q--)
{
int x,k;
cin >> x >> k;
if(x == 1)
{
if(a[k-1] == 1)
{
a[k-1] = 0;
flag[0]++;
flag[1]--;
}
else
{
a[k-1] = 1;
flag[0]--;
flag[1]++;
}
}
else
(k <= flag[1])? cout << 1 << endl : cout << 0 << endl;
}
}
1051. Height Checker | 695. Max Area of Island |
402. Remove K Digits | 97. Interleaving String |
543. Diameter of Binary Tree | 124. Binary Tree Maximum Path Sum |
1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts | 501A - Contest |
160A- Twins | 752. Open the Lock |
1535A - Fair Playoff | 1538F - Interesting Function |
1920. Build Array from Permutation | 494. Target Sum |
797. All Paths From Source to Target | 1547B - Alphabetical Strings |
1550A - Find The Array | 118B - Present from Lena |
27A - Next Test | 785. Is Graph Bipartite |
90. Subsets II | 1560A - Dislike of Threes |
36. Valid Sudoku | 557. Reverse Words in a String III |
566. Reshape the Matrix | 167. Two Sum II - Input array is sorted |
387. First Unique Character in a String | 383. Ransom Note |
242. Valid Anagram | 141. Linked List Cycle |